Pros/Cons of a fixed array:
- Indexed access performance does not change as an array "grows"
- Indexed access performance is similar to the trivial operation of incrementing a number (i.e. "count++")
- Big-O notation O(1) means an algorithm has performance that is constant (unchanging) as a structure "grows"
- A fixed array is not dynamic or flexible which means it does not support adding or removing elements
Boiled down:
- Fixed arrays have a "BIG ADVANTAGE" of having superb indexed access performance (regardless of size)
- Fixed arrays have a "BIG DISADVANTAGE" of not support adding or removing elements
Future considerations:
- Could we design a (best of both worlds) structure that maintains the (performance) advantages and overcomes the (fixed size) disadvantages?